companding of dynamic range


companding of dynamic range
компандирование динамического диапазона

English-Russian dictionary of telecommunications. 2015.

Смотреть что такое "companding of dynamic range" в других словарях:

  • Dynamic range — For other uses, see Dynamic range (disambiguation). Dynamic range, abbreviated DR or DNR,[1] is the ratio between the largest and smallest possible values of a changeable quantity, such as in sound and light. It is measured as a ratio, or as a… …   Wikipedia

  • Dynamic range compression — This article is about a process that intentionally reduces the dynamic range of audio signals. For similar reductions caused by circuit imperfections, see Gain compression. For processes that reduce the size of digital audio files, see Audio… …   Wikipedia

  • Dynamic Markov compression — (DMC) is a lossless data compression algorithm developed by Gordon Cormack and Nigel Horspool [1]. It uses predictive arithmetic coding similar to prediction by partial matching (PPM), except that the input is predicted one bit at a time (rather… …   Wikipedia

  • Companding — Original signal After compressing, before expanding In …   Wikipedia

  • companding — /keuhm pan ding/, n. a process in which the dynamic range of a signal is reduced for recording purposes and then expanded to its original value for reproduction or playback. [1965 70; COMPAND(ER) + ING1] * * * …   Universalium

  • companding — /keuhm pan ding/, n. a process in which the dynamic range of a signal is reduced for recording purposes and then expanded to its original value for reproduction or playback. [1965 70; COMPAND(ER) + ING1] …   Useful english dictionary

  • μ-law algorithm — Companding of μ law and A law algorithms The µ law algorithm (often u law, ulaw, or mu law) is a companding algorithm, primarily used in the digital telecommunication systems of North America and Japan. Companding algorithms reduce the dynamic… …   Wikipedia

  • A-law algorithm — Graph of μ law A law algorithms An A law algorithm is a standard companding algorithm, used in European digital communications systems to optimize, i.e., modify, the dynamic range of an analog signal for digitizing. It is similar to the μ law… …   Wikipedia

  • DEFLATE — redirects here. For other uses, see Deflation (disambiguation). Deflate is a lossless data compression algorithm that uses a combination of the LZ77 algorithm and Huffman coding. It was originally defined by Phil Katz for version 2 of his PKZIP… …   Wikipedia

  • Data compression — Source coding redirects here. For the term in computer programming, see Source code. In computer science and information theory, data compression, source coding or bit rate reduction is the process of encoding information using fewer bits than… …   Wikipedia

  • Adaptive Huffman coding — (also called Dynamic Huffman coding) is an adaptive coding technique based on Huffman coding. It permits building the code as the symbols are being transmitted, having no initial knowledge of source distribution, that allows one pass encoding and …   Wikipedia